Relational Reasoning for Recursive Types and References
نویسندگان
چکیده
We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our development builds on the work of Benton and Leperchey, who devised a nominal semantics and a local relational reasoning method for a language with simple types and simple references. Their method uses a parameterized logical relation. Here we extend their approach to recursive types and general references. For the extension, we build upon Pitts’ and Shinwell’s work on relational reasoning about recursive types (but no references) in nominal semantics. The extension is non-trivial because of general references (higher-order store) and makes use of some new ideas for proving the existence of the parameterized logical relation and for the choice of parameters.
منابع مشابه
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
We present a realizability model for a call-by-value, higher-order programming language with parametric polymorphism, general first-class references, and recursive types. The main novelty is a relational interpretation of open types (as needed for parametricity reasoning) that include general reference types. The interpretation uses a new approach to modeling references. The universe of semanti...
متن کاملRealisability semantics of parametric polymorphism, general references and recursive types
We present a realisability model for a call-by-value, higher-order programming language with parametric polymorphism, general first-class references, and recursive types. The main novelty is a relational interpretation of open types that include general reference types. The interpretation uses a new approach to modelling references. The universe of semantic types consists of world-indexed famil...
متن کاملRelational Interpretations of Recursive Types in an Operational Setting
Relational interpretations of type systems are useful for establishing properties of programming languages. For languages with recursive types it is usually di cult to establish the existence of a relational interpretation. The usual approach is to give a denotational semantics of the language in a domain-theoretic model given by an inverse limit construction, and to construct relations over th...
متن کاملStep-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a λ-calculus with recursive types and impredicative universal and existential types. We show that for recursive and polymorphic types, the method is both sound and complete with respect to contextual equivalence, while for existential types, it is sound but incomplete. Our de...
متن کاملData Model of FRDB with Different Data Types and PFSQL
One of the disadvantages of the relational model is its disability to model uncertain and incomplete data. The idea to use fuzzy sets and fuzzy logic to extend existing database models to include these possibilities has been utilized since the 1980s. Although this area has been researched for a long time, concrete implementations are rare. Literature contains references to several models of fuz...
متن کامل